Chain Rules for Smooth Min- and Max-Entropies
نویسندگان
چکیده
منابع مشابه
Chain rules and subadditivity for Tsallis entropies
Chain rules for Tsallis type entropies are proven, as including the famous pseudoadditivity in nonextensive statistics as a special case. They give important relations between Tsallis conditional entropy and Tsallis joint entropy. Moreover the subadditivity of Tsallis type entropies is shown for the correlated two random variables in the case of q ≥ 1 with the help of the generalized Shannon in...
متن کاملSteepest Descent Adaptation of Min-Max Fuzzy If-Then Rules
Abstract A new technique for adaptation of fuzzy membership functions in a fuzzy inference system is proposed. The technique relies upon the isolation of the specific membership function that contributed to the final decision, followed by the updating of this function’s parameters using steepest descent. The error measure used is thus back propagated from output to input, through the min and ma...
متن کاملStrong Chain Rules for Min-Entropy under Few Bits Spoiled
It is well established that the notion of min-entropy fails to satisfy the chain rule of the form H(X,Y ) = H(X|Y )+ H(Y ), known for Shannon Entropy. The lack of a chain rule causes a lot of technical difficulties, particularly in cryptography where the chain rule would be a natural way to analyze how min-entropy is split among smaller blocks. Such problems arise for example when constructing ...
متن کاملMin, Max, and Sum
This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...
متن کاملMax and min limiters
If A ⊆ ω, n ≥ 2, and the function max({x1, . . . , xn} ∩ A) is partial recursive, it is easily seen that A is recursive. In this paper, we weaken this hypothesis in various ways (and similarly for “min” in place of “max”) and investigate what effect this has on the complexity of A. We discover a sharp contrast between retraceable and coretraceable sets, and we characterize sets which are the un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2238656